Efficient Secure Multi-party Computation

Efficient Secure Multi-party Computation (Extended Abstract)

Efficient Two Party and Multi Party Computation Against Covert Adversaries

Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert adversaries. They were able to utilize cut and...

Quorum-Based Secure Multi-party Computation

This paper describes efficient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to access structures based on quorum systems, which are collections of sets enjoying a naturallymotivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general,...

Efficient Three-Party Computation from Cut-and-Choose

With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols—in particular, the cut-and-choose approach—can be adapted to the multi-party setting. In this work we explore the possibility of using cut-and-choose for practical...

Actively Secure Two-Party Computation: Efficient Beaver Triple Generation

Author: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013 Supervisor: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013 Supervisor: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013 Instructor: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " ...

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

Recently, there has been huge progress in the field of concretely efficient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the twoparty setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely efficient fully-secure protocols, such as SPD...